Hausdorff measure of uniform self-similar fractals

نویسنده

  • Wolfgang Kreitmeier
چکیده

Let d ≥ 1 be an integer and E a self-similar fractal set, which is the attractor of a uniform contracting iterated function system (UIFS) on Rd. Denote by D the Hausdorff dimension, by HD(E) the Hausdorff measure and by diam(E) the diameter of E. If the UIFS is parametrised by its contracting factor c, while the set ω of fixed points of the UIFS does not depend on c, we will show the existence of a positive constant depending only on ω, such that the Hausdorff dimension is smaller than one and HD(E) = diam(E)D if c is smaller than this constant. We apply our result to modified versions of various classical fractals. Moreover we present a parametrised UIFS where ω depends on c and HD(E) < diam(E)D, if c is small enough. MSC(2010): 28A80, 28A78 keywords: Self-similar set, Hausdorff measure

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hanoi attractors and the Sierpiński gasket

The famous game Towers of Hanoi is related with a family of so–called Hanoi–graphs. We regard these non self–similar graphs as geometrical objects and obtain a sequence of fractals (HGα)α converging to the Sierpiński gasket which is one of the best studied fractals. It is shown that this convergence holds not only with respect to the Hausdorff distance, but that also Hausdorff dimension does co...

متن کامل

Random subsets of self-affine fractals

We find the almost sure Hausdorff and box-counting dimensions of random subsets of self-affine fractals obtained by selecting subsets at each stage of the hierarchical construction in a statistically self-similar manner.

متن کامل

A Novel Solution for the Hausdorff Measure Computation of Sierpinski Carpet

The computation of the Hausdorff measure of fractals is the basic problem in fractal geometry. However, this is very difficult. The genetic algorithm is one of optimization algorithms to resolve complicated problems of wide scope, and has great capabilities in self-organizing, self-adaptation and self-learning. Lifeng Xi professor put forward to the thought of computing the Hausdorff measure of...

متن کامل

Decidability on Dube's Self-similar Fractals

Dube proved some undecidability on self-affine fractals. In this paper, we obtain the decidability for self-similar fractal of Dube’s type. In fact, we prove that the following problems are decidable to test if the Hausdorff dimension of a given Dube’s self-similar set is equal to its similarity dimension, and to test if a given Dube’s self-similar set satisfies the strong separation condition.

متن کامل

Perturbation of self-similar sets and some regular configurations and comparison of fractals

We consider several distances between two sets of points, which are modifications of the Hausdorff metric, and apply them to describe some fractals such as δ-quasi-self-similar sets, and some other geometric notions in Euclidean space, such as tilings with quasi-prototiles and patterns with quasi-motifs. For the δ-quasi-self-similar sets satisfying the open set condition we obtain the same resu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010